Stability and Nash Implementation in Matching Markets with Couples

نویسندگان

  • Claus-Jochen Haake
  • Bettina Klaus
چکیده

We consider two-sided matching markets with couples. First, we extend a result by Klaus and Klijn (2005, Theorem 3.3) and show that for any weakly responsive couples market there always exists a “double stable” matching, i.e., a matching that is stable for the couples market and for any associated singles market. Second, we show that for weakly responsive couples markets the associated stable correspondence is (Maskin) monotonic and Nash implementable. In contrast, the correspondence that assigns all double stable matchings is neither monotonic nor Nash implementable. JEL classification: C62, C78, D78, J41.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Paths to stability for matching markets with couples

We study two-sided matching markets with couples and show that for a natural preference domain for couples, the domain of weakly responsive preferences, stable outcomes can always be reached by means of decentralized decision making. Starting from an arbitrary matching, we construct a path of matchings obtained from ‘satisfying’ blocking coalitions that yields a stable matching. Hence, we estab...

متن کامل

Monotonicity and Nash Implementation in Matching Markets with Contracts

We consider general two-sided matching markets, so-called matching with contracts markets as introduced by Hatfield and Milgrom (2005), and analyze (Maskin) monotonic and Nash implementable solutions. We show that for matching with contracts markets the stable correspondence is monotonic and implementable (Theorems 1 and 3). Furthermore, any solution that is Pareto efficient, individually ratio...

متن کامل

Stability in Large Matching Markets with Complementarities

Labor markets can often be viewed as many-to-one matching markets. It is well-known that if complementarities are present in such a market, a stable matching may not exist. We study large matching markets with complementarities, focusing primarily on matching markets with couples. We introduce a new matching procedure and show that if the number of couples grows slower than the size of the mark...

متن کامل

Stable marriages and search frictions

Stable matchings are the primary solution concept for two-sided matching markets with nontransferable utility. We investigate the strategic foundations of stability in a decentralized matching market. Towards this end, we embed the standard marriage markets in a search model with random meetings. We study the limit of steady-state equilibria as exogenous frictions vanish. The main result is tha...

متن کامل

Matching Markets with Couples Revisited

It is well known that a stable matching in a two-sided matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for a general class of large random markets the algorithm will find a stable matching with high probability. In particular we allow the number of couples grow in an ‘almost’ linear rate. Furthermore, the mechanism induced by the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008